Utilization based Spare Capacity Distribution
نویسندگان
چکیده
Flexible real-time applications have predefined temporal limits within which they can operate. Real-time systems that support flexible scheduling need a mechanism to distribute spare capacity in a predictable way among the running applications with respect to the applications’ temporal limits and available system resources. This paper introduces a greedy algorithm for spare capacity distribution in flexible real-time systems to increase resource utilization during run-time. The efficiency of the proposed algorithm is evaluated by empirical tests. Additionally, performance measurements were carried out on embedded hardware to draw conclusions about the applicability of the proposed algorithm in real applications.
منابع مشابه
A new model for Assessment and Optimization of Number of Spare Transformers and their Locations in Distribution Systems
In this paper, a new model has been presented to determine the number of spare transformers and their locations for distribution stations. The number of spare transformers must be so that they need minimum investment. Furthermore, they must be sufficient for replacing with transformers that have been damaged. For this reason, in this paper a new purpose function has been presented to maximize p...
متن کاملA Longitudinal Study of Utilization at Internet Interconnection Points
The increase in high-volume traffic flows due to applications such as video streaming draw new attention on utilization at the interconnections between the Internet’s independently operated networks. This paper surveys the findings from nearly two years of Internet utilization data provided by seven participating ISPs—Bright House Networks, Comcast, Cox, Mediacom, Midco, Suddenlink, and Time Wa...
متن کاملSpare Capacity Distribution Using Exact Response-Time Analysis
Real-time systems designed for use in dynamic open environments allow applications to enter and leave the system during runtime. This leads to changing runtime scenarios where the load and the spare capacity of hardware resources is influenced by the resource demand of running applications. Flexible real-time application components, with variable temporal parameters, can adapt their timing beha...
متن کاملQuick-release Fair Scheduling
In prior work on multiprocessor fairness, efficient techniques with provable properties for reallocating spare processing capacity have been elusive. In this paper, we address this shortcoming by proposing a new notion of multiprocessor fairness, called quick-release fair (QRfair) scheduling, which is a derivative of Pfair scheduling that allows efficient allocation of spare capacity. Under QRf...
متن کاملRevealing Utilization at Internet Interconnection Points
Recent Internet interconnection disputes have sparked an increased interest in developing methods for gathering and collecting data about utilization at interconnection points. One mechanism, developed by DeepField Networks, allows Internet service providers (ISPs) to gather and aggregate utilization information using network flow statistics, standardized in the Internet Engineering Task Force ...
متن کامل